A pair of nonisomorphic $\equiv_{\infty \lambda}$ models of power $\lambda$ for $\lambda$ singular with $\lambda_\omega=\lambda$.
نویسندگان
چکیده
منابع مشابه
Lambda Theories of Effective Lambda Models
A longstanding open problem is whether there exists a nonsyntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which covers...
متن کاملOn the Spaces of $lambda _{r}$-almost Convergent and $lambda _{r}$-almost Bounded Sequences
The aim of the present work is to introduce the concept of $lambda _{r}$-almost convergence of sequences. We define the spaces $fleft( lambda _{r}right) $ and $f_{0}left( lambda _{r}right) $ of $ lambda _{r}$-almost convergent and $lambda _{r}$-almost null sequences. We investigate some inclusion relations concerning those spaces with examples and we determine the $beta $- and $gamma $-duals of...
متن کاملp-Lambda-bounded variation
A characteriation of continuity of the $p$-$Lambda$-variation function is given and the Helly's selection principle for $Lambda BV^{(p)}$ functions is established. A characterization of the inclusion of Waterman-Shiba classes into classes of functions with given integral modulus of continuity is given. A useful estimate on modulus of variation of functions of class $Lambda BV^{(p)}$ is found.
متن کاملEffective lambda-models vs recursively enumerable lambda-theories
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...
متن کاملTwo Behavioural Lambda Models
We build two inverse limit lambda models which characterize completely sets of terms having similar computational behaviour. More precisely for each one of these sets of terms there is a corresponding element in at least one of the two models such that a term belongs to the set if and only if its interpretation (in a suitable environment) is greater than or equal to that element. This is proved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1984
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093870570